Cache Influence on Worst Case Execution Time of Network Stacks
نویسندگان
چکیده
We apply the cache partitioning technique on a network stack to derive the influence of caches on worst case execution times of complex applications. We demonstrate that the overhead caused by cache misses when receiving packets of typical sizes from the network is reduced from 310% to 90% compared to the best case. For the transmit direction, cache partitioning results in a reduction of the overhead from 78% to 26%.
منابع مشابه
PRADA: Predictable Allocations by Deferred Actions
Modern hard real-time systems still employ static memory management. However, dynamic storage allocation (DSA) can improve the flexibility and readability of programs as well as drastically shorten their development times. But allocators introduce unpredictability that makes deriving tight bounds on an application’s worst-case execution time even more challenging. Especially their statically un...
متن کاملSensitivity Analysis of Cache Replacement Policies
Caches are commonly employed to hide the latency gap between memory and the CPU by exploiting locality in memory accesses. On today’s architectures a cache miss may cost several hundred CPU cycles. In order to fulfill stringent performance requirements, caches are also used in hard real-time systems. In such systems, upper and lower bounds on the execution time of tasks have to be computed. Dif...
متن کاملOS-Controlled Cache Predictability for Real-Time Systems
3rd IEEE Real-time Technology and Applications Symposium (RTAS), June 1997 in Montreal, Canada Cache-partitioning techniques have been invented to make modern processors with an extensive cache structure useful in real-time systems where task switches disrupt cache working sets and hence make execution times unpredictable. This paper describes an OS-controlled applicationtransparent cache-parti...
متن کاملAnalyse pire cas pour processeur multi-cœurs disposant de caches partagés
Hard real-time systems are subject to timing constraints and failure to respectthem can cause economic, ecological or human disasters. The validation processwhich guarantees the safety of such software, by ensuring the respect of theseconstraints in all situations including the worst case, is based on the knowledgeof the worst case execution time of each task. However, determini...
متن کاملPredicting Instruction Cache Behavior
It has been claimed that the execution time of a program can often be predicted more accurately on an uncached system than on a system with cache memory 5, 20]. Thus, caches are often disabled for critical real-time tasks to ensure the predictability required for scheduling analysis. This work shows that instruction caching can be exploited to gain execution speed without sacriicing predictabil...
متن کامل